Homogeneously representable interval graphs
نویسندگان
چکیده
منابع مشابه
Homogeneously Orderable Graphs
In this paper we introduce homogeneously orderable graphs which are a common generalization of distance-hereditary graphs, dually chordal graphs and homogeneous graphs. We present a characterization of the new class in terms of a tree structure of the closed neighborhoods of homogeneous sets in 2-graphs which is closely related to the defining elimination ordering. Moreover, we characterize the...
متن کاملOn 132-representable graphs
A graphG = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if xy is an edge in E. Word-representable graphs are the main focus in “Words and Graphs” by Kitaev and Lozin. A word w = w1 · · ·wn avoids the pattern 132 if there are no 1 ≤ i1 < i2 < i3 ≤ n such that wi1 < wi3 < wi2. A recently suggested research direction ...
متن کاملOn Representable Graphs
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x 6= y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. Examples of non-representable graphs are found in this paper. Some wide classes of graphs are proven to be 2and 3-representable. Seve...
متن کاملHomogeneously Embedding Stratified Graphs in Stratified Graphs
A 2-stratified graph G is a graph whose vertex set has been partitioned into two subsets, called the strata or color classes of G. Two 2-stratified graphs G and H are isomorphic if there exists a color-preserving isomorphism φ from G to H. A 2-stratified graph G is said to be homogeneously embedded in a 2-stratified graph H if for every vertex x of G and every vertex y of H, where x and y are c...
متن کاملHomogeneously almost self-complementary graphs
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, we study a special class of vertex-transitive almost self-complementary graphs called homogeneously almost selfcomplementary. These graphs occur as factors of symmetric index-2 homogeneous factorizations of the “cocktail party graphs” K2n − nK2. We con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1985
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90049-4